A novel four-step search algorithm for fast block motion estimation
نویسندگان
چکیده
vector distribution, a new four-step search (4SS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed in this paper. Halfway-stop technique is employed in the new algorithm with searching steps of 2 to 4 and the total number of checking points is varied from 17 to 27. Simulation results show that the proposed 4SS performs better than the well-known three-step search and has similar performance to the new three-step search (N3SS) in terms of motion compensation errors. In addition, the 4SS also reduces the worst-case computational requirement from 33 to 27 search points and the average computational requirement from 21 to 19 search points as compared with N3SS. _______________________________________ This paper was published in IEEE Trans. Circuits Syst. Video Technol., vol. 6, No. 3, pp. 313-317, Jun. 1996. The authors are with the CityU Image Processing Lab, Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong. Email: [email protected]
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملA Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS), four-step search (4SS), new three-step search (NTSS), and recently proposed diamond search (DS) methods. Experimental results show that the prop...
متن کاملAnalysis of Block Matching Algorithms with Fast Computational and Winner-update Strategies
Block matching for motion estimation has been widely used in video compression for efficient transmission and storage of video bit stream by reducing the temporal redundancy existing in a video sequence. The motion estimation is a process to predict the motion between two successive frames. This paper is primarily a review of the block matching algorithms using fast computational and winner-upd...
متن کاملA Novel Four-Step Search Algorithm for Fast Block Motion Estimation - Circuits and Systems for Video Technology, IEEE Transactions on
Based on the real world image sequence’s characteristic of center-biased motion vector distribution, a new four-step search (4SS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed in this paper. Halfway-stop technique is employed in the new algorithm with searching steps of 2 to 4 and the total number of checking points is varied from 17 to 27. Sim...
متن کامل8-bit Partial Sums of 16 Luminance Values for Fast Block Motion Estimation
Fast block motion estimation algorithms are needed for real-time implementations of video coding standards due to the high computational complexity of the full-search algorithm for block motion estimation. In this paper, an algorithm using 8-bit partial sums of 16 luminance values for a fast block motion estimation is proposed. The technique of using the partial sums is employed to reduce the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Circuits Syst. Video Techn.
دوره 6 شماره
صفحات -
تاریخ انتشار 1996